The Erdős–Faber–Lovász conjecture for weakly dense hypergraphs
نویسندگان
چکیده
Generalizing the concept of dense hypergraph, we say that a hypergraph with n edges is weakly dense, if no k in half-open interval [2,n) degree more than k2 vertices. In our main result, prove famous Erdős–Faber–Lovász conjecture when dense.
منابع مشابه
The 1-2-3-Conjecture for Hypergraphs
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this paper we show that such a weighting is possible from the weight set {1, 2, . . . , r + 1} for all linear hypergraphs with maximum edge size r ≥ 4 and not containin...
متن کاملSaturated and weakly saturated hypergraphs
Lubell proved this by observing that the left-hand side is a probability: it is simply the probability that a maximal chain, chosen uniformly at random, intersects A. The LYM inequality implies that an antichain in P([n]) has size at most ( n bn/2c ) , the size of the ‘middle layer’ in P([n]). (This can also be proved by partitioning P([n]) into ( n bn/2c ) disjoint chains.) Bollobás’ Inequalit...
متن کاملPartitioning problems in dense hypergraphs
We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma [16] and its algorithmic version proved in [5], we give polynomial time approximation schemes for the general partitioning problem and for the discrepancy problem.
متن کاملFractional Decompositions of Dense Hypergraphs
A seminal result of Rödl (the Rödl nibble) asserts that the edges of the complete r-uniform hypergraph Kr n can be packed, almost completely, with copies of Kr k , where k is fixed. We prove that the same result holds in a dense hypergraph setting. It is shown that for every r-uniform hypergraph H0, there exists a constant α = α(H0) < 1 such that every r-uniform hypergraph H in which every (r −...
متن کاملThe 1-2-3 Conjecture for Uniform Hypergraphs
Given an r-uniform hypergraph H = (V,E) and a weight function ω : E → {1, . . . , w}, a coloring of vertices of H, induced by ω, is defined by c(v) = ∑ e3v w(e) for all v ∈ V . In this paper, we show that for almost all 3-uniform hypergraphs there exists a weighting of the edges from {1, 2} that induces a proper vertex-coloring (that means with no monochromatic edges). For r ≥ 4, we show that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112401